Mond-Weir type second order multiobjective mixed symmetric duality with square root term under generalized univex function
نویسنده
چکیده
In this paper, a new class of second order ( , ) -univex and second order ( , ) pseudo univex function are introduced with example. A pair Mond-Weir type second order mixed symmetric duality for multiobjective nondifferentiable programming is formulated and the duality results are established under the mild assumption of second order ( , ) univexity and second order pseudo univexity. Special cases are discussed to show that this study extends some of the known results in related domain.
منابع مشابه
Second Order Duality in Multiobjective Fractional Programming with Square Root Term under Generalized Univex Function
Three approaches of second order mixed type duality are introduced for a nondifferentiable multiobjective fractional programming problem in which the numerator and denominator of objective function contain square root of positive semidefinite quadratic form. Also, the necessary and sufficient conditions of efficient solution for fractional programming are established and a parameterization tech...
متن کاملOptimality and Duality for Multiple-Objective Optimization with Generalized α-Univex Functions
The aim of the present paper is to obtain a number of Kuhn-Tucker type sufficient optimality conditions for a feasible solution to be an efficient solution under the assumptions of the new notions of weak strictly pseudo quasi α-univex, strong pseudo quasi α-univex, and weak strictly pseudo α-univex vector valued functions. We also derive the duality theorems for Mond-Weir and general Mond-Wei...
متن کاملSymmetric Duality for Mathematical Programming in Complex Spaces with Second Order F-univexity
Bector et al., (1994) introduced the concept of univexity. Mishra (1998), Mishra and Reuda (2001) and Mishra et al., (2005) have applied and generalized these functions. Mathematical programming in complex spaces originated from Levinson’s discussion of linear problems (Levinson, 1966). Mishra and Reuda (2003) have generalized these upto first orders, second order with symmetric duality. Furthe...
متن کاملNondifferentiable multiobjective programming under generalized dI-invexity
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with inequality constraints. We introduce four new classes of generalized convex functions by combining the concepts of weak strictly pseudoinvex, strong pseudoinvex, weak quasi invex, weak pseudoinvex and strong quasi invex functions in Aghezzaf and Hachimi [Numer. Funct. Anal. Optim. 22 (2001) 775], d-...
متن کاملNondifferentiable multiobjective second-order symmetric duality
⎯In this paper, we construct a pair of Mond-Weir type second order symmetric dual problems, in which the objective function contains support function and is, therefore, nondifferentiable. For this pair of problems, we validate weak, strong and converse duality theorems under pseudobonvexity – pseudoboncavity assumption on the kernel function that appears in the problems. A second order self dua...
متن کامل